Optimized Dynamic Traffic Grooming for Multicast Traffic in Optical WDM Networks

The dynamic traffic-grooming problem in wavelength routed networks is generally a two-layered routing problem in which traffic connections are routed over light paths in the virtual topology layer and light paths are routed over physical links in the physical topology layer. Traffic grooming for multicast communication in WDM networks has received very little attention to date. In this paper, we investigate the problem of grooming multicast traffic in WDM networks. We develop an optimized dynamic traffic grooming algorithm to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization as well as minimizing the blocking probability. By simulation results, we show that our proposed algorithm achieves better throughput and bandwidth utilization with reduced blocking probability.